Improved Grid Map Layout by Point Set Matching
نویسندگان
چکیده
منابع مشابه
New Layout Strategies with Improved Matching Performance
In this paper, the systematic mismatch error in integrated circuits due to gradient effects is modeled and analyzed. Three layout strategies with improved matching performance are reviewed and summarized. The hexagonal tessellation pattern can cancel quadratic gradient errors with only 3 units for each device and has high area-efficiency when extended. Both the N th-order circular symmetry patt...
متن کاملEfficient Colored Point Set Matching Under Noise
Let A and B be two colored point sets in R2, with |A| ≤ |B|. We propose a process for determining matches, in terms of the bottleneck distance, betweenA and subsets of B under color preserving rigid motion, assuming that the position of all colored points in both sets contains a certain amount of ”noise”. The process consists of two main stages: a lossless filtering algorithm and a matching alg...
متن کاملVersatile spectral methods for point set matching
This work is concerned with the problem of point set matching over features extracted from images. A novel approach to the problem is proposed which leverages different techniques from the literature. It combines a number of similarity metrics that quantify measures of correspondence between the two sets of features and introduces a non-iterative algorithm for feature matching based on spectral...
متن کاملIsometry-invariant Matching of Point Set Surfaces
Shape deformations preserving the intrinsic properties of a surface are called isometries. An isometry deforms a surface without tearing or stretching it, and preserves geodesic distances. We present a technique for matching point set surfaces, which is invariant with respect to isometries. A set of reference points, evenly distributed on the point set surface, is sampled by farthest point samp...
متن کاملOn the Curve/Point Set Matching Problem
Let P be a polygonal curve in R of length n, and S be a point set of size k. We consider the problem of finding a polygonal curve Q on S such that all points in S are visited and the Fréchet distance between Q and P is at most a given ε. We show that this problem is NP-complete, regardless of whether or not the points of S are allowed to be visited more than once.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Geometry & Applications
سال: 2015
ISSN: 0218-1959,1793-6357
DOI: 10.1142/s0218195915500077